Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
0(#) |
→ # |
| 2: |
|
# + x |
→ x |
| 3: |
|
x + # |
→ x |
| 4: |
|
0(x) + 0(y) |
→ 0(x + y) |
| 5: |
|
0(x) + 1(y) |
→ 1(x + y) |
| 6: |
|
1(x) + 0(y) |
→ 1(x + y) |
| 7: |
|
0(x) + j(y) |
→ j(x + y) |
| 8: |
|
j(x) + 0(y) |
→ j(x + y) |
| 9: |
|
1(x) + 1(y) |
→ j((x + y) + 1(#)) |
| 10: |
|
j(x) + j(y) |
→ 1((x + y) + j(#)) |
| 11: |
|
1(x) + j(y) |
→ 0(x + y) |
| 12: |
|
j(x) + 1(y) |
→ 0(x + y) |
| 13: |
|
(x + y) + z |
→ x + (y + z) |
| 14: |
|
opp(#) |
→ # |
| 15: |
|
opp(0(x)) |
→ 0(opp(x)) |
| 16: |
|
opp(1(x)) |
→ j(opp(x)) |
| 17: |
|
opp(j(x)) |
→ 1(opp(x)) |
| 18: |
|
x - y |
→ x + opp(y) |
| 19: |
|
# * x |
→ # |
| 20: |
|
0(x) * y |
→ 0(x * y) |
| 21: |
|
1(x) * y |
→ 0(x * y) + y |
| 22: |
|
j(x) * y |
→ 0(x * y) - y |
| 23: |
|
(x * y) * z |
→ x * (y * z) |
|
There are 32 dependency pairs:
|
| 24: |
|
0(x) +# 0(y) |
→ 0#(x + y) |
| 25: |
|
0(x) +# 0(y) |
→ x +# y |
| 26: |
|
0(x) +# 1(y) |
→ x +# y |
| 27: |
|
1(x) +# 0(y) |
→ x +# y |
| 28: |
|
0(x) +# j(y) |
→ x +# y |
| 29: |
|
j(x) +# 0(y) |
→ x +# y |
| 30: |
|
1(x) +# 1(y) |
→ (x + y) +# 1(#) |
| 31: |
|
1(x) +# 1(y) |
→ x +# y |
| 32: |
|
j(x) +# j(y) |
→ (x + y) +# j(#) |
| 33: |
|
j(x) +# j(y) |
→ x +# y |
| 34: |
|
1(x) +# j(y) |
→ 0#(x + y) |
| 35: |
|
1(x) +# j(y) |
→ x +# y |
| 36: |
|
j(x) +# 1(y) |
→ 0#(x + y) |
| 37: |
|
j(x) +# 1(y) |
→ x +# y |
| 38: |
|
(x + y) +# z |
→ x +# (y + z) |
| 39: |
|
(x + y) +# z |
→ y +# z |
| 40: |
|
OPP(0(x)) |
→ 0#(opp(x)) |
| 41: |
|
OPP(0(x)) |
→ OPP(x) |
| 42: |
|
OPP(1(x)) |
→ OPP(x) |
| 43: |
|
OPP(j(x)) |
→ OPP(x) |
| 44: |
|
x -# y |
→ x +# opp(y) |
| 45: |
|
x -# y |
→ OPP(y) |
| 46: |
|
0(x) *# y |
→ 0#(x * y) |
| 47: |
|
0(x) *# y |
→ x *# y |
| 48: |
|
1(x) *# y |
→ 0(x * y) +# y |
| 49: |
|
1(x) *# y |
→ 0#(x * y) |
| 50: |
|
1(x) *# y |
→ x *# y |
| 51: |
|
j(x) *# y |
→ 0(x * y) -# y |
| 52: |
|
j(x) *# y |
→ 0#(x * y) |
| 53: |
|
j(x) *# y |
→ x *# y |
| 54: |
|
(x * y) *# z |
→ x *# (y * z) |
| 55: |
|
(x * y) *# z |
→ y *# z |
|
The approximated dependency graph contains 3 SCCs:
{25-33,35,37-39},
{41-43}
and {47,50,53-55}.
-
Consider the SCC {25-33,35,37-39}.
The usable rules are {1-13}.
The constraints could not be solved.
-
Consider the SCC {41-43}.
There are no usable rules.
By taking the AF π with
π(0) = π(1) = π(OPP) = 1 together with
the lexicographic path order with
empty precedence,
the rules in {41,42}
are weakly decreasing and
rule 43
is strictly decreasing.
There is one new SCC.
-
Consider the SCC {41,42}.
By taking the AF π with
π(0) = π(OPP) = 1 together with
the lexicographic path order with
empty precedence,
rule 41
is weakly decreasing and
rule 42
is strictly decreasing.
There is one new SCC.
-
Consider the SCC {41}.
By taking the AF π with
π(OPP) = 1 together with
the lexicographic path order with
empty precedence,
rule 41
is strictly decreasing.
-
Consider the SCC {47,50,53-55}.
The constraints could not be solved.
Tyrolean Termination Tool (3.15 seconds)
--- May 4, 2006